/**
*      author: Y_Yao
*      created: 2024-10-17 20:54:29
**/

#include<bits/stdc++.h>

using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 100 + 7;
int a[N];

void solve()
{
    int n = 0;
    cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i];

    int ji = 0,ou = 0;
    for(int i = 1;i <= n;i += 2)
    {
        ji = max(ji,a[i]);
    }

    for(int i = 2;i <= n;i += 2)
    {
        ou = max(ou,a[i]);
    }

    cout << max(ji + (n + 1) / 2,ou + n / 2) << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}